#include <iostream>
#include<vector>
using namespace std;
const int maxn = 1e4 + 10;

int dp[maxn]; //表示以i为结尾的最长连续递增子序列的长度
int n;
int x;
vector<int> nums;

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> x;
        nums.push_back(x);
    }
    dp[0] = 1;
    int ans = 1;
    for (int i = 1; i < nums.size(); i++)
    {

        if (nums[i] > nums[i-1])
        {
            dp[i] = max(dp[i], dp[i-1] + 1);
        }
        else
            dp[i] = 1;

        ans = max(ans, dp[i]);
    }
    cout << ans << endl;
    system("pause");
    return 0;
}
